Port directed communication
نویسندگان
چکیده
منابع مشابه
Decentralized Consensus Protocols with Multi-Port Communication
We develop in this paper eecient decentralized consensus protocols for a distributed system with multi-port communication. Given an arbitrary number of nodes in a system, the proposed protocols can reach the consensus in the minimal numbers of message steps. Speciically, we develop two classes of decentralized consensus protocols: the one without an ini-tiator and the one with an initiator. We ...
متن کاملdigital communication nets and n-port resistive networks
a communication net is usually represented by a linear graph g whose branches represent channels for information flow and whose vertices represent sources, sinks and switching centers. the purpose of this paper is to show that for modeling digital communication nets, conventional use of the concepts of capacity and terminal capacity is inadequate . we will present an alternative to max-flow min...
متن کاملCrossing Minimization and Layouts of Directed Hypergraphs with Port Constraints
Many practical applications for drawing graphs are modeled by directed graphs with domain specific constraints. In this paper, we consider the problem of drawing directed hypergraphs with (and without) port constraints, which cover multiple real-world graph drawing applications like data flow diagrams and electric schematics. Most existing algorithms for drawing hypergraphs with port constraint...
متن کاملCommunication for Goal Directed Agents
This paper dis usses some modeling issues on erning the ommuni ation between goal-dire ted agents. In parti ular, the role of performatives in agent ommuni ation is dis ussed. It is argued that the spe i ation of the e e t of performatives, as pres ribed by FIPA, is sometimes too weak or unrealisti . The alternative, proposed in this paper, suggests a two phase modeling of the e e t of the ommu...
متن کاملOptimal All-to-All Personalized Communication in All-Port Tori
All-to-all personalized communication, also known as complete exchange, is one of the most dense communication patterns in parallel computing. In this paper, we propose new indirect algorithms for complete exchange on all-port ring and torus. The new algorithms fully utilize all communication links and transmit messages along shortest paths to completely achieve the theoretical lower bounds on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1981
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/24.1.78